منابع مشابه
Boundary-connectivity via Graph Theory
We generalize theorems of Kesten and Deuschel-Pisztora about the connectedness of the exterior boundary of a connected subset of Zd, where “connectedness” and “boundary” are understood with respect to various graphs on the vertices of Zd. These theorems are widely used in statistical physics and related areas of probability. We provide simple and elementary proofs of their results. It turns out...
متن کاملRandom Graph Coverings I: General Theory and Graph Connectivity
In this paper we describe a simple model for random graphs that have an n-fold covering map onto a fixed finite base graph. Roughly, given a base graph G and an integer n, we form a random graph by replacing each vertex of G by a set of n vertices, and joining these sets by random matchings whenever the corresponding vertices are adjacent in G. The resulting graph covers the original graph in t...
متن کاملBoundary Control Design for Cascades of Hyperbolic 2× 2 PDE systems via Graph Theory
This article is concerned with the design of boundary control laws for stabilizing systems of 2 × 2 first order quasi-linear hyperbolic PDEs. A new graph representation of such systems represents the interactions between the characteristic curves and the boundary control laws, the invariant graph, is introduced. The structure of the invariant graph is used to design stabilizing control laws and...
متن کاملGraph Connectivity
This work is mainly concerned with the strength of connections between vertices with respect to the number of vertexor edge-disjoint paths. As we shall see, this is equivalent to the question of how many nodes or edges must be removed from a graph to destroy all paths between two (arbitrary or specified) vertices. We review algorithms which • check k-vertex (k-edge) connectivity, • compute the ...
متن کاملWavelets on Graphs via Spectral Graph Theory
We propose a novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite weighted graph. Our approach is based on defining scaling using the graph analogue of the Fourier domain, namely the spectral decomposition of the discrete graph Laplacian L. Given a wavelet generating kernel g and a scale parameter t, we define the scaled wavelet operator T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2012
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-2012-11333-4